A $q$-weighted version of the Robinson-Schensted algorithm
نویسندگان
چکیده
منابع مشابه
A q-weighted version of the Robinson-Schensted algorithm
We introduce a q-weighted version of the Robinson-Schensted (column insertion) algorithm which is closely connected to q-Whittaker functions (or Macdonald polynomials with t = 0) and reduces to the usual Robinson-Schensted algorithm when q = 0. The q-insertion algorithm is ‘randomised’, or ‘quantum’, in the sense that when inserting a positive integer into a tableau, the output is a distributio...
متن کاملA $q$-Robinson-Schensted-Knuth Algorithm and a $q$-Polymer
In Matveev-Petrov (2017) a q-deformed Robinson-Schensted-Knuth algorithm (qRSK) was introduced. In this article we give reformulations of this algorithm in terms of the Noumi-Yamada description, growth diagrams and local moves. We show that the algorithm is symmetric, namely the output tableaux pairs are swapped in a sense of distribution when the input matrix is transposed. We also formulate a...
متن کاملA Robinson - Schensted Algorithm for a Class of Partial Orders
Let P be a nite partial order which does not contain an induced subposet isomorphic with 3 + 1, and let G be the incomparability graph of P . Gasharov has shown that the chromatic symmetric function XG has nonnegative coe cients when expanded in terms of Schur functions; his proof uses the dual Jacobi-Trudi identity and a sign-reversing involution to interpret these coe cients as numbers of P -...
متن کاملRobinson-Schensted algorithm and Vogan equivalence
We provide a combinatorial proof for the coincidence of Knuth equivalence classes, Kazhdan–Lusztig left cells and Vogan classes for the symmetric group, involving only Robinson-Schensted algorithm and the combinatorial part of the Kazhdan–Lusztig cell theory. The determination of Kazhdan–Lusztig cells for the symmetric group is given in the proof of [4, Thm1.4]. The argument is largely combinat...
متن کاملProperties of the nonsymmetric Robinson-Schensted-Knuth algorithm
We introduce a generalization of the Robinson-Schensted-Knuth algorithm to composition tableaux involving an arbitrary permutation. If the permutation is the identity our construction reduces to Mason’s original composition Robinson-Schensted-Knuth algorithm. In particular we develop an analogue of Schensted insertion in our more general setting, and use this to obtain new decompositions of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 2013
ISSN: 1083-6489
DOI: 10.1214/ejp.v18-2930